Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
401	Confluence in Data Reduction: Bridging Graph Transformation and Kernelization∗ Hartmut Ehrig Claudia Ermel Falk H¨ uffner† Add to Reading List Source URL: www.user.tu-berlin.de Language: English - Date: 2013-01-21 07:14:53 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Kernelization Clique Intersection number Graph Path decomposition Graph theory Theoretical computer science Mathematics
402	Optim Lett:287–295 DOIs11590ORIGINAL PAPER A generalization of the Motzkin–Straus theorem to hypergraphs Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:14:22 Clique Extremal graph theory Hypergraph Degree Line graph Graph structure theorem Graph theory NP-complete problems Graph operations
403	Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2014-04-18 21:30:54 NP-complete problems Operations research Combinatorial optimization Linear programming Travelling salesman problem Linear programming relaxation Relaxation Graph Shortest path problem Theoretical computer science Mathematics Graph theory
404	Incremental List Coloring of Graphs, Parameterized by ConservationI Sepp Hartunga , Rolf Niedermeiera a Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-22 17:08:40 Graph coloring NP-complete problems List coloring Parameterized complexity Kernelization Vertex cover Independent set Edge coloring Complete coloring Graph theory Theoretical computer science Mathematics
405	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems
406	Irene Moulitsas and George Karypis University of Minnesota, Department of Computer Science / Army HPC Research Center Minneapolis, MN 55455 moulitsa, karypis @cs.umn.edu Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2001-12-10 13:46:18 Mesh generation NP-complete problems Multigrid method Numerical analysis Wavelets Graph partition Unstructured grid Regular grid Biconnected component Mathematics Theoretical computer science Graph theory
407	Evaluation of ILP-based Approaches for Partitioning into Colorful Components Sharon Bruckner1? , Falk H¨ uffner2?? , Christian Komusiewicz2 , and Rolf Niedermeier2 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-03-13 14:59:55 NP-complete problems Graph partition Clique Graph coloring Vertex Connected component Breadth-first search Connectivity Tree Graph theory Theoretical computer science Mathematics
408	The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-07-31 12:35:33 NP-complete problems Graph coloring Degeneracy Vertex cover Edge coloring Clique Vertex Graph Dense subgraph Graph theory Theoretical computer science Mathematics
409	Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-03 17:31:15 Planar graphs Network theory Directed acyclic graph Graph coloring Shortest path problem Hypercube graph Planarity testing Hamiltonian path Tree Graph theory Theoretical computer science NP-complete problems
410	W h e r e t h e Really H a r d P r o b l e m s A r e Peter Cheeseman Bob Kanefsky W i l l i a m M . Taylor Add to Reading List Source URL: www.dcs.gla.ac.uk Language: English - Date: 2009-10-23 06:18:38 Complexity classes NP-complete problems Mathematical optimization Graph theory Graph coloring NP-complete Connectivity 2-satisfiability NP Theoretical computer science Computational complexity theory Mathematics

UPDATE